Decomposing 8-regular graphs into paths of length 4
نویسندگان
چکیده
A T -decomposition of a graph G is a set of edge-disjoint copies of T in G that cover the edge set of G. Graham and Häggkvist (1989) conjectured that any 2l-regular graph G admits a T -decomposition if T is a tree with l edges. Kouider and Lonc (1999) conjectured that, in the special case where T is the path with l edges, G admits a T -decomposition D where every vertex of G is the end-vertex of exactly two paths of D, and proved that this statement holds when G has girth at least (l+ 3)/2. In this paper we verify Kouider and Lonc’s Conjecture for paths of length 4.
منابع مشابه
Decomposing Graphs into Long Paths
It is known that the edge set of a 2-edge-connected 3-regular graph can be decomposed into paths of length 3. W. Li asked whether the edge set of every 2-edge-connected graph can be decomposed into paths of length at least 3. The graphs C3, C4, C5, and K4 − e have no such decompositions. We construct an infinite sequence {Fi}∞i=0 of nondecomposable graphs. On the other hand, we prove that every...
متن کاملShort paths in ε-regular pairs and small diameter decompositions of dense graphs
In this paper we give optimal optimal vertex degree conditions that guarantee connection by short paths in ε-regular bipartite graphs. We also study a related question of decomposing an arbitrary graph into subgraphs of small diameter.
متن کاملDecomposing Highly Connected Graphs into Paths of Length Five
Barát and Thomassen (2006) posed the following decomposition conjecture: for each tree T , there exists a natural number kT such that, if G is a kT -edge-connected graph and |E(G)| is divisible by |E(T )|, then G admits a decomposition into copies of T . In a series of papers, Thomassen verified this conjecture for stars, some bistars, paths of length 3, and paths whose length is a power of 2. ...
متن کاملDecomposing series-parallel graphs into paths of length 3 and triangles
An old conjecture by Jünger, Reinelt and Pulleyblank states that every 2-edgeconnected planar graph can be decomposed into paths of length 3 and triangles, provided its size is divisible by 3. We prove the conjecture for a class of planar graphs including all 2-edge-connected series-parallel graphs. We also present a 2edge-connected non-planar graph that can be embedded on the torus and admits ...
متن کاملA Proof of the Two-path Conjecture
Let G be a connected graph that is the edge-disjoint union of two paths of length n, where n ≥ 2. Using a result of Thomason on decompositions of 4-regular graphs into pairs of Hamiltonian cycles, we prove that G has a third path of length n. The “two-path conjecture” states that if a graph G is the edge-disjoint union of two paths of length n with at least one common vertex, then the graph has...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 340 شماره
صفحات -
تاریخ انتشار 2017